Schedulability analysis of global Deadline-Monotonic scheduling
نویسنده
چکیده
The multiprocessor Deadline-Monotonic (DM) scheduling of sporadic task systems is studied. A new sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guarantees, including a resource augmentation bound.
منابع مشابه
Global DM schedulability analysis: upper and lower bounds∗
A new technique was recently introduced [7] for the analysis of real-time systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) scheduling algorithm. In this paper, this technique is adapted and applied to the schedulability analysis of realtime systems scheduled on multiprocessor platforms by the global Deadline-Monotonic (DM) scheduling algorithm. It is sho...
متن کاملMultiprocessor EDF and Deadline Monotonic Schedulability Analysis
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue -server system, in which the deadline of a task may be less than or equal to the task period. These results subsume and generalize several known utilization-based multiprocessor schedulability tests, and are derived via an independe...
متن کاملNew Schedulability Tests for Real-Time Task Sets Scheduled by Deadline Monotonic on Multiprocessors
In this paper, we address the problem of schedulability analysis of a set of real-time periodic (or sporadic) tasks on multiprocessor hardware platforms, under fixed priority global scheduling. In a multiprocessor system with M processors, a global scheduler consists of a single queue of ready tasks for all processors, and the scheduler selects the first M tasks to execute on the M processors. ...
متن کاملMultiprocessor EDF and Deadline Monotonic Schedulability
Schedulability tests are presented for preemptive earliest-deadlinerst and deadline-monotonic scheduling of periodic real-time tasks on a singlequeue m-server system, in which the deadline of a task may be less than or equal to the task period. These results subsume and generalize several known utilization-based multiprocessor schedulability tests, and are derived via an independent proof.
متن کاملAn Analysis of Deadline-Monotonic Schedulability on a Multiprocessor
A new schedulability test is presented for preemptive deadline-monotonic scheduling of periodic or sporadic real-time tasks on a single-queue m-server system. This generalizes and extends a result of Andersson, Baruah, and Jonsson, for the case where deadline equals period, which showed all deadlines will be met if the total utilization is at most m=(3m 1) and the utilization of each task is at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007